On the Equivalence of Weighted Finite-state Transducers
نویسنده
چکیده
Although they can be topologically different, two distinct transducers may actually recognize the same rational relation. Being able to test the equivalence of transducers allows to implement such operations as incremental minimization and iterative composition. This paper presents an algorithm for testing the equivalence of deterministic weighted finite-state transducers, and outlines an implementation of its applications in a prototype weighted finite-state calculus tool.
منابع مشابه
Flexible Speech Synthesis Using Weighted Finite State Transducers
Flexible Speech Synthesis Using Weighted Finite State Transducers
متن کاملThe Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
We show that it is undecidable whether two finite substitutions agree on the binary language a∗b. This in particular means that equivalence of nondeterministic finite transducers is undecidable even for two-state transducers with unary input alphabet and whose all transitions start from the initial state.
متن کاملWeighted Finite-State Transducer Algorithms An Overview
Weighted finite-state transducers are used in many applications such as text, speech and image processing. This chapter gives an overview of several recent weighted transducer algorithms, including composition of weighted transducers, determinization of weighted automata, a weight pushing algorithm, and minimization of weighted automata. It briefly describes these algorithms, discusses their ru...
متن کاملEquivalence of Finite-Valued Symbolic Finite Transducers
Symbolic Finite Transducers, or SFTs, is a representation of finite transducers that annotates transitions with logical formulas to denote sets of concrete transitions. This representation has practical advantages in applications for web security analysis, where it provides ways to succinctly represent web sanitizers that operate on large alphabets. More importantly, the representation is also ...
متن کاملEfficient Algorithms for Testing the Twins Property
Weighted automata and transducers are powerful devices used in many large-scale applications. The efficiency of these applications is substantially increased when the automata or transducers used are deterministic. There exists a general determinization algorithm for weighted automata and transducers that is an extension of the classical subset construction used in the case of unweighted finite...
متن کامل